Optimal Decoding of Linear Codes for Minimizing Symbol

نویسنده

  • J. RAVIV
چکیده

The previous are identical to the expressions (2) and (3). Thus the n 1 columns do consist of two repetitions of 2”-r-level Gray code. Now if we combine the first two columns again, we reduce each 2”-‘-level Gray code into two 2n-2-level Gray codes, or, the complete array into four 2”-2-level Gray codes. This can continue until we have only m columns, which would be 2n-m repetitions of 2”‘-level Gray code. We have thus derived the lemma.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Simple One-Sweep Algorithm for Optimal APP Symbol Decoding of Linear Block Codes

Soft-input/soft-output symbol decoding plays a significant role in iterative decoding. We propose a simple optimal soft-input/softoutput symbol decoding algorithm for linear block codes which requires one forward recursion using a trellis. For many codes the decoding complexity is lower than previous methods, such as the algorithm by Bahl et al. [1], and the decrease is shown at its most when d...

متن کامل

A Simple One Sweep Algorithm for Optimal

| Soft-input/soft-output symbol decoding plays a signiicant role in iterative decoding. We propose a simple optimal soft-input/soft-output symbol decoding algorithm for linear block codes which requires one forward recursion using a trellis. For many codes the decoding complexity is lower than previous methods, such as the algorithm by Bahl et. al. 1], and the decrease is shown at its most when...

متن کامل

Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)

The previous are identical to the expressions (2) and (3). Thus the n 1 columns do consist of two repetitions of 2”-r-level Gray code. Now if we combine the first two columns again, we reduce each 2”-‘-level Gray code into two 2n-2-level Gray codes, or, the complete array into four 2”-2-level Gray codes. This can continue until we have only m columns, which would be 2n-m repetitions of 2”‘-leve...

متن کامل

On Full Diversity Space-Time Block Codes with Partial Interference Cancellation Group Decoding

In this paper, we propose a partial interferencecancellation (PIC) group decoding strategy/scheme for linear dis-persive space-time block codes (STBC) and a design criterion forthe codes to achieve full diversity when the PIC group decoding isused at the receiver. A PIC group decoding decodes the symbolsembedded in an STBC by dividing them into several groupsand decoding...

متن کامل

MMSE Optimal Space-Time Block Codes from Crossed Product Algebras

Design of Space-Time Block codes (STBCs) for Maximum Likelihood (ML) reception has been predominantly the main focus of researchers. However the ML decoding complexity of STBCs become prohibitive large as the number of transmit and receive antennas increase. To solve this problem, orthogonal designs, single symbol ML decodable and double symbol ML decodable STBCs have been proposed in the liter...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1972